The Pointer Assertion Logic Engine
نویسندگان
چکیده
منابع مشابه
Propositional Logic of Supposition and Assertion
1 and suggestions of my colleague John Corcoran. The present paper is much superior to earlier versions as a result of his input. 1 1. LANGUAGE AND SPEECH ACTS In this paper I develop a system of what I understand to be illocutionary logic. In order to motivate this system and make it intelligible to the reader, I briefly sketch a philosophical basis for the system. This sketchy foundation will...
متن کاملAn Assertion Language for Constraint Logic Programs
In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways. Also, these tools may interact among themselves and with the user. Thus, the different tools and the user need some way to communicate. It is our design principie that such communication...
متن کاملSALT - Structured Assertion Language for Temporal Logic
This paper presents Salt. Salt is a general purpose specification and assertion language developed for creating concise temporal specifications to be used in industrial verification environments. It incorporates ideas of existing approaches, such as specification patterns, but also provides nested scopes, exceptions, support for regular expressions and real-time. The latter is needed in particu...
متن کاملScope Logic: Extending Hoare Logic for Pointer Program Verification
This paper presents an extension to Hoare logic for pointer program verification. First, the Logic for Partial Function (LPF) used by VDM is extended to specify memory access using pointers and memory layout of composite types. Then, the concepts of data-retrieve functions (DRF) and memory-scope functions (MSF) are introduced in this paper. People can define DRFs to retrieve abstract values fro...
متن کاملProving Pointer Programs in Hoare Logic
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of Hoare logic’s treatment of variable assignment, where substitution affects only relevant assertion formulæ. The axiom of assignment to object components treats each component name as a pointerindexed array. This permi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2000
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v7i39.20205